An S-adic characterization of minimal subshifts with first difference of complexity 1 ≤ p(n+1) - p(n) ≤ 2
نویسنده
چکیده
In [Ergodic Theory Dynam. System, 16 (1996) 663–682], S. Ferenczi proved that any minimal subshift with first difference of complexity bounded by 2 is S-adic with Card(S) ≤ 327. In this paper, we improve this result by giving an S-adic charaterization of these subshifts with a set S of 5 morphisms, solving by this way the S-adic conjecture for this particular case.
منابع مشابه
An $S$-adic characterization of minimal subshifts with first difference of complexity $1 \leq p(n+1) - p(n) \leq 2$
In [Ergodic Theory Dynam. System, 16 (1996) 663–682], S. Ferenczi proved that any minimal subshift with first difference of complexity bounded by 2 is S-adic with Card(S) ≤ 327. In this paper, we improve this result by giving an S-adic charaterization of these subshifts with a set S of 5 morphisms, solving by this way the S-adic conjecture for this particular case.
متن کاملComments on "A New Method to Compute the 2-Adic Complexity of Binary Sequences"
We show that there is a very simple approach to determine the 2-adic complexity of periodic binary sequences with ideal two-level autocorrelation. This is the first main result by H. Xiong, L. Qu, and C. Li, IEEE Transactions on Information Theory, vol. 60, no. 4, pp. 2399-2406, Apr. 2014, and the main result by T. Tian and W. Qi, IEEE Transactions on Information Theory, vol. 56, no. 1, pp. 450...
متن کاملLower bound on the 2-adic complexity of Ding-Helleseth generalized cyclotomic sequences of period $p^n$
Let p be an odd prime, n a positive integer and g a primitive root of pn. Suppose D (p) i = {g 2s + i|s = 0, 1, 2, · · · , (p−1)p n−1 2 }, i = 0, 1 is the generalized cyclotomic classes with Z∗ pn = D0 ∪D1. In this paper, we prove that Gauss periods based on D0 and D1 are both equal to 0 for n ≥ 2. As an application, we determine a lower bound on the 2-adic complexity of generalized cyclotomic ...
متن کاملMultivariate P-adic L-function
In the recent, many mathematicians studied the multiple zeta function in the complex number field. In this paper we construct the p-adic analogue of multiple zeta function which interpolates the generalized multiple Bernoulli numbers attached to χ at negative integers. §1. Introduction Let p be a fixed prime. Throughout this paper Z p , Q p , C and C p will, respectively, denote the ring of p-a...
متن کاملDesign of new pseudorandom generators based on a filtered FCSR automaton
Feedback with Carry Shift Registers (FCSR) were introduced by M. Goresky and A. Klapper in 1993. They are very similar to classical Linear Feedback Shift Registers (LFSR) used in many pseudorandom generators. The main difference is the fact that the elementary additions are not additions modulo 2 but with propagation of carries. In this paper we propose a new generator designed from a FCSR auto...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics & Theoretical Computer Science
دوره 16 شماره
صفحات -
تاریخ انتشار 2014